Modular Inference Trees for Expository Reports
نویسنده
چکیده
When people write a report that involves a complex argument towards a conclusion, they can use a design tool called the inference tree, which enables them to outline the argument, and quickly detect reasoning errors in the outline. Yet when the argument is very complex, the inference tree may spread over several pages, so that writers may often have to flip back and forth between those pages. To prevent unnecessary flipping, they can draw the tree as a hierarchy of modules, similar to a modular hierarchy of program flowcharts or structure charts, where a major module controls several minor modules. In drawing the tree, writers can adopt four principles of Computing: modularity, the criterion of minimal coupling between modules, and the methods of forward and backward chaining to draw all the modules.
منابع مشابه
Visual Coherence Breaks within Expository Films
Theoretical Background This study takes part in a series of studies that analyze bridging inferences within expository films. According to Graesser, León and Otero (2002) bridging inferences establish coherence which is necessary to establish a coherent mental model. In other words: If a coherence break (CB) occurs the reader needs to solve the CB by generating a bridging inference in order to ...
متن کاملAnaphoric Inference in Expository Text: The Effects of Anaphora Type, Mention Order and Typicality of Antecedent
Introduction Anaphora has an important function in text comprehension. The processes of anaphoric inference are to make local coherence among sentences. The coherence constructed from several variables (e.g. Lee, 1993). The first variable is an anaphora type: noun phrase, pronoun or ellipsis. Another variable is the properties of antecedents: syntactic, semantic, or pragmatic. Yet another varia...
متن کاملAn Overview of Hopf Algebras of Trees and Their Actions on Functions
We provide an expository account of some of the Hopf algebras that can be defined using trees, labeled trees, ordered trees and heap ordered trees. We also describe some actions of these Hopf algebras on algebra of functions.
متن کاملCoinductive Pearl: Modular First-Order Logic Completeness
Codatatypes are regrettably absent from many programming languages and proof assistants. We make a case for their usefulness by revisiting a classic result: the completeness theorem for first-order logic established through a Gentzen system. Codatatypes help capture the essence of the proof, which establishes an abstract property of derivation trees independently of the concrete syntax or infer...
متن کاملSemantic Inference at the Lexical-Syntactic Level for Textual Entailment Recognition
We present a new framework for textual entailment, which provides a modular integration between knowledge-based exact inference and cost-based approximate matching. Diverse types of knowledge are uniformly represented as entailment rules, which were acquired both manually and automatically. Our proof system operates directly on parse trees, and infers new trees by applying entailment rules, aim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- InformingSciJ
دوره 8 شماره
صفحات -
تاریخ انتشار 2005